#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<vector>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define rep(i,a,b) for(register int i = (a);i <= (b);++i)
#define per(i,a,b) for(register int i = (a);i >= (b);--i) 
#define mkp std::make_pair
typedef long long ll;
typedef unsigned long long ull;
using std::string;using std::cin;using std::cout;
inline bool cmp(int x,int y){return x < y;}

const int N = 3e6+9;
const int inf = 1e9+9;
const double eps = 1e-7;

/*
设 p = k * i + r
即 k * r^-1 + i^-1 = 0 (mod p)
得 i^-1 = - k * r^-1 (mod p)
变 i^-1 = - [p/i] * inv[p % i]
*/

ll n,p;
int inv[2*N];

int main(){
    std::ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    #ifdef LOCAL //use "g++ xxx.cpp -DLOCAL"
        freopen("in.in", "r", stdin);
    #endif
    cin >> n >> p;
    inv[1] = 1;
    rep(i,2,n) inv[i] = (p - (p/i*inv[p%i])%p)%p; 
    rep(i,1,n) cout << inv[i] << "\n";
    return 0;
}